Threshold Circuits for Iterated Matrix Product and Powering
نویسندگان
چکیده
منابع مشابه
Uniform constant-depth threshold circuits for division and iterated multiplication
It has been known since the mid-1980's [15, 46, 47] that integer division can be performed by poly-time uniform constant-depth circuits of Majority gates; equivalently, the division problem lies in P-uniform TC 0. Recently this was improved to L-uniform TC 0 [19], but it remained unknown whether division can be performed by DLOGTIME-uniform TC 0 circuits. The DLOGTIME uniformity condition is re...
متن کاملPowering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m 6 poly(n). Let L̂Td denote the class of functions computable by a depth-d polynomial-size circuit of majority gates. We give a simple proof that POWm 6∈ L̂T2 for any m > 2. Specifically, we prove a 2Ω(n/ logn) lower bound on the size of any depth-2 majority circ...
متن کاملGeometric complexity theory and matrix powering
Valiant’s famous determinant versus permanent problem is the flagship problem in algebraic complexity theory. Mulmuley and Sohoni (Siam J Comput 2001, 2008) introduced geometric complexity theory, an approach to study this and related problems via algebraic geometry and representation theory. Their approach works by multiplying the permanent polynomial with a high power of a linear form (a proc...
متن کاملNew Efficient Majority Circuits for the Computation of Some Basic Arithmetic Functions
We construct constant-depth majority circuits to perform iterated addition, multiplication, powering, and multiple product computation. Our results indicate that unit-weight majority circuits are almost as powerful as threshold circuits with large weights in computing several important arithmetic functions, while being considerably less costly to implement. In particular, we construct circuits ...
متن کاملPolynomial Threshold Functions and Boolean Threshold Circuits
We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is {1, 2}. We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2000
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2000105